Variational quantum algorithm with information sharing

Quantum Secret Sharing with Grover’s Algorithm

Quantum secret sharing addresses the same problem that classical secret sharing does, but via quantum means. That is, Alice wishes to send a secret to n agents, and any k ≤ n agents can collaborate to recover the secret. However, for any fewer than k agents, collaboration will information-theoretically reveal no information about the secret. Such protocols are called (k,n)threshold schemes, and...

Quantum information sharing between topologically distinct platforms

Chang-Yu Hou,1,2 Gil Refael,1,3 and Kirill Shtengel2,3,4 1Department of Physics, California Institute of Technology, Pasadena, California 91125, USA 2Department of Physics and Astronomy, University of California at Riverside, Riverside, California 92521, USA 3Institute for Quantum Information and Matter, California Institute of Technology, Pasadena, California 91125, USA 4Institute for Solid St...

The IM Algorithm: A Variational Approach to Information Maximization

The maximisation of information transmission over noisy channels is a common, albeit generally computationally difficult problem. We approach the difficulty of computing the mutual information for noisy channels by using a variational approximation. The resulting IM algorithm is analagous to the EM algorithm, yet maximises mutual information, as opposed to likelihood. We apply the method to sev...

Multiparty secret sharing of quantum information based on entanglement swapping

A protocol of multiparty secret sharing of quantum information based on entanglement swapping is analyzed. In this protocol, Bell states are needed in order to realize the quantum information secret sharing and it is convenient to realize the quantum secret sharing among the members of any subset of users.  2004 Elsevier B.V. All rights reserved. PACS: 03.67.Dd; 03.65.Ud

Patient Satisfaction With Information Sharing.